Ciphertext-Auditable Identity-Based Encryption

نویسندگان

  • Changlu Lin
  • Yong Li
  • Kewei Lv
  • Chin-Chen Chang
چکیده

Ciphertext-auditability of public key encryption scheme means that the ciphertext should been verified by anyone whether it was actually created by the public key. It also should satisfy two additional requirements: 1) no adversary can create a valid-looking ciphertext and then it can pass the verification process together with a public key and a plaintext; 2) the plaintext cannot be revealed from ciphertext without the help of the correct private key. This paper, in the first time, proposes an ciphertext-auditable identity-based encryption. Our scheme doesn’t need the certificates and the sender can directly encrypt message via using the identity without the progress of public key authentication. Furthermore, the proposed scheme is provably secure under the standard model against the k-resilient ciphertext-auditability.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Threshold Identity Based Encryption Scheme without Random Oracles

The first threshold identity-based encryption scheme secure against chosen identity and ciphertext attacks is proposed in this paper. Our construction is based on the recently proposed identity-based encryption scheme of Waters in EUROCRYPT 2005. The new threshold identity-based encryption scheme is non-interactive and does not rely on the random oracle model.

متن کامل

On the Security of An Identity Based Broadcast Encryption Scheme

Recently, Ren and Gu proposed a new identity-based broadcast encryption scheme, and claimed that their scheme is secure against chosen-ciphertext attack in the standard model. However, by giving a concrete attack, we indicate that Ren and Gu’s scheme is even not secure against chosen-plaintext attack. Keywordsidentity based broadcast encryption, chosen-ciphertext attack, chosen-plaintext attack...

متن کامل

Identity-Based Encryption from the Weil Pairing

We propose a fully functional identity-based encryption scheme (IBE). The scheme has chosen ciphertext security in the random oracle model assuming a variant of the computational DiffieHellman problem. Our system is based on bilinear maps between groups. The Weil pairing on elliptic curves is an example of such a map. We give precise definitions for secure identity based encryption schemes and ...

متن کامل

Direct Chosen-Ciphertext Secure Identity-Based Key Encapsulation Without Random Oracles

We describe a new and practical identity-based key encapsulation mechanism that is secure in the standard model against chosen-ciphertext (CCA2) attacks. Since our construction is direct and not based on hierarchical identity-based encryption, it is more efficient than all previously proposed schemes. Furthermore, we give the first chosen-ciphertext secure identity-based key encapsulation mecha...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • I. J. Network Security

دوره 17  شماره 

صفحات  -

تاریخ انتشار 2015